Bounded-degree polyhedronization of point sets
نویسندگان
چکیده
منابع مشابه
Bounded-degree polyhedronization of point sets
In 1994 Grünbaum showed that, given a point set S in R, it is always possible to construct a polyhedron whose vertices are exactly S. Such a polyhedron is called a polyhedronization of S. Agarwal et al. extended this work in 2008 by showing that there always exists a polyhedronization that can be decomposed into a union of tetrahedra (tetrahedralizable). In the same work they introduced the not...
متن کاملInvertible Families of Sets of Bounded Degree
Let H = (H; V) be a hypergraph with edge set H and vertex set V. Then H is invertible ii there exists a permutation of V such that for all E 2 H, (E) \ E = ;. H is invertibility critical if H is not invertible but every hypergraph obtained by removing an edge from H is invertible. The degree of H is d if fE 2 Hjx 2 Eg d for each x 2 V. Let i(d) be the maximum number of edges of an invertibility...
متن کاملIndependent Sets in Bounded-Degree Hypergraphs
In this paper we analyze several approaches to the Maximum Independent Set (MIS) problem in hypergraphs with degree bounded by a parameter ∆. Since independent sets in hypergraphs can be strong and weak, we denote by MIS (MSIS) the problem of finding a maximum weak (strong) independent set in hypergraphs, respectively. We propose a general technique that reduces the worst case analysis of certa...
متن کاملFUZZY BOUNDED SETS AND TOTALLY FUZZY BOUNDED SETS IN I-TOPOLOGICAL VECTOR SPACES
In this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. Thena relation between totally fuzzy bounded sets and N-compactness is discussed.Finally, a geometric characterization for fuzzy totally bounded sets in I- topologicalvector spaces is derived.
متن کاملIndependent Sets near the Lower Bound in Bounded Degree Graphs
By Brook’s Theorem, every n-vertex graph of maximum degree at most ∆ ≥ 3 and clique number at most ∆ is ∆-colorable, and thus it has an independent set of size at least n/∆. We give an approximate characterization of graphs with independence number close to this bound, and use it to show that the problem of deciding whether such a graph has an indepdendent set of size at least n/∆ + k has a ker...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2012.02.008